Enumeration of the Binary Self-Dual Codes of Length 34

نویسندگان

  • R. T. Bilous
  • G. H. J. van Rees
چکیده

An (n, k) binary self-orthogonal code is an (n, k) binary linear code C that is contained in its orthogonal complement C⊥. A self-orthogonal code C is self-dual if C = C⊥. Two codes, C1 and C2, are equivalent if and only if there exists a coordinate permutation of C1 that takes C1 into C2. The automorphism group of a code C is the set of all coordinate permutations of C that takes C into itself. This paper is a continuation of the work presented in [2], in which we described algorithms for enumerating inequivalent binary self-dual codes. We used our algorithms to enumerate the self-dual codes of length up to and including 32. Our algorithms also found the size of the automorphism group of each code. We have since made several improvements to our algorithms. In particular, our algorithms now finds generators for the automorphism group of each code. We have used our improved algorithms to enumerate the self-dual codes of length 34. We have also found the automorphism groups for each of our self-dual codes of length less than or equal to 34. The list of length 34 codes are new, as are the lists of automorphism groups for the length 32 and 34 codes.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Enumeration of Binary Self-Dual Codes

We give a classification of singly-even self-dual binary codes of length 32, by enumerating all neighbours of the known 85 doublyeven self-dual binary codes of length 32. There are 3, 210 singly-even self-dual binary codes of length 32 up to equivalence. This agrees in number with the enumeration by Bilous and van Rees, who enumerated these codes by a different method.

متن کامل

An Enumeration of Binary Self-Dual Codes of Length 32

A binary self-dual code of length 2k is a (2k, k) binary linear code C with the property that every pair of codewords in C are orthogonal. Two self-dual codes, C1 and C2, are equivalent if and only if there is a permutation of the coordinates of C1 that takes C1 into C2. The automorphism group of a binary code C is the set of all permutations of the coordinates of C that takes C into itself. Th...

متن کامل

The Binary Self-Dual Codes of Length up to 32: A Revised Enumeration

This paper presents a revised enumeration of the binary self-dual codes of length up to 32 given by Conway and Pless in 1978-1980. The list of 85 doubly-even selfdual codes of length 32 is essentially correct, but several of their descriptions need amending. The principal change is that there are 731 (not 664) inequivalent selfdual codes of length 30. Furthermore, there are three (not two) [28,...

متن کامل

Binary s - extremal self - dual codes of length 68 do exist 1

We study binary self-dual codes with an automorphism of order 7 and minimum distance 12 or 14 for lengths 64 ≤ n ≤ 70. A classification of all codes of length 9 over the set P of all even-weight polynomials in F2[x]/〈x − 1〉 such that the minimum distance of the binary projection is at least 12, is proven. Using one particular such code we have constructed six inequivalent s-extremal binary self...

متن کامل

On the Classification and Enumeration of Self-Dual Codes

A complete classification is given of all [22, 111 and [24, 121 binary self-dual codes. For each code we give the order of its group, the number of codes equivalent to it, and its weight distribution. There is a unique [24, 12, 61 selfdual code. Several theorems on the enumeration of self-dual codes are used, including formulas for the number of such codes with minimum distance > 4, and for the...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004